Factors and Irreducibility of Generalized Stern Polynomials
نویسندگان
چکیده
We investigate an infinite class of polynomial sequences at(n; z) with integer parameter t 1, which reduce to the well-known Stern (diatomic) sequence when z = 1 and are (0, 1)-polynomials when t 2. These sequences are related to the theory of hyperbinary expansions. The main purpose of this paper is to obtain various irreducibility and factorization results, most of which involve cyclotomic polynomials.
منابع مشابه
T. N. Shorey’s Influence in the Theory of Irreducible Polynomials
The idea of looking at the prime factorization of the coefficients of a polynomial in Z[x] in order to establish its irreducibility (over Q) goes back to the classical Schönemann-Eisenstein criterion first derived in [29] and [6] in the middle of the 19th century. At the beginning of the 20th century, G. Dumas [5], again making use of primes that divide the coefficients of a polynomial, introdu...
متن کاملPolynomial irreducibility testing through Minkowski summand computation
In this paper, we address the problem of deciding absolute irreducibility of multivariate polynomials. Our work has been motivated by a recent work due to Gao et. al. [1, 2, 3] where they have considered the problem for bivariate polynomials by studying the integral decomposability of polygons in the sense of Minkowski sum. We have generalized their result to polynomials containing arbitrary nu...
متن کاملDeterminants and permanents of Hessenberg matrices and generalized Lucas polynomials
In this paper, we give some determinantal and permanental representations of generalized Lucas polynomials, which are a general form of generalized bivariate Lucas p-polynomials, ordinary Lucas and Perrin sequences etc., by using various Hessenberg matrices. In addition, we show that determinant and permanent of these Hessenberg matrices can be obtained by using combinations. Then we show, the ...
متن کاملTests and Constructions of Irreducible Polynomials over Finite Fields
In this paper we focus on tests and constructions of irreducible polynomials over nite elds. We revisit Rabin's (1980) algorithm providing a variant of it that improves Rabin's cost estimate by a log n factor. We give a precise analysis of the probability that a random polynomial of degree n contains no irreducible factors of degree less than O(log n). This probability is naturally related to B...
متن کاملGeneralized numerical ranges of matrix polynomials
In this paper, we introduce the notions of C-numerical range and C-spectrum of matrix polynomials. Some algebraic and geometrical properties are investigated. We also study the relationship between the C-numerical range of a matrix polynomial and the joint C-numerical range of its coefficients.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015